Percolative Properties of Brownian Interlacements and Its Vacant Set
نویسنده
چکیده
Abstract In this article we investigate the percolative properties of Brownian interlacements, a model introduced by Alain-Sol Sznitman in [28], and show that: the interlacement set is “well-connected”, i.e., any two “sausages” in d-dimensional Brownian interlacements, d ≥ 3, can be connected via no more than d(d − 4)/2e intermediate sausages almost surely; while the vacant set undergoes a non-trivial percolation phase transition when the level parameter varies.
منابع مشابه
A lower bound for disconnection by random interlacements
We consider the vacant set of random interlacements on Z, d ≥ 3, in the percolative regime. Motivated by the large deviation principles recently obtained in [13], we investigate the asymptotic behavior of the probability that a large body gets disconnected from infinity by the random interlacements. We derive an asymptotic lower bound, which brings into play tilted interlacements, and relates t...
متن کاملConnectivity Bounds for the Vacant Set of Random Interlacements
The model of random interlacements on Z, d ≥ 3, was recently introduced in [4]. A non-negative parameter u parametrizes the density of random interlacements on Z. In the present note we investigate connectivity properties of the vacant set left by random interlacements at level u, in the non-percolative regime u > u∗, with u∗ the non-degenerate critical parameter for the percolation of the vaca...
متن کاملOn the fragmentation of a torus by random walk
Abstract. We consider a simple random walk on a discrete torus (Z/NZ) with dimension d ≥ 3 and large side length N . For a fixed constant u ≥ 0, we study the percolative properties of the vacant set, consisting of the set of vertices not visited by the random walk in its first [uN] steps. We prove the existence of two distinct phases of the vacant set in the following sense: if u > 0 is chosen ...
متن کاملGIANT VACANT COMPONENT LEFT BY A RANDOM WALK IN A RANDOM d-REGULAR GRAPH
We study the trajectory of a simple random walk on a d-regular graph with d ≥ 3 and locally tree-like structure as the number n of vertices grows. Examples of such graphs include random d-regular graphs and large girth expanders. For these graphs, we investigate percolative properties of the set of vertices not visited by the walk until time un, where u > 0 is a fixed positive parameter. We sho...
متن کاملOn the Uniqueness of the Infinite Cluster of the Vacant Set of Random Interlacements
We consider the model of random interlacements on Z introduced in Sznitman [Vacant set of random interlacements and percolation (2007) preprint]. For this model, we prove the uniqueness of the infinite component of the vacant set. As a consequence, we derive the continuity in u of the probability that the origin belongs to the infinite component of the vacant set at level u in the supercritical...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016